Approximating the inverse of a symmetric positive definite matrix
نویسندگان
چکیده
منابع مشابه
A Randomized Algorithm for Approximating the Log Determinant of a Symmetric Positive Definite Matrix
We introduce a novel algorithm for approximating the logarithm of the determinant of a symmetric positive definite matrix. The algorithm is randomized and proceeds in two steps: first, it finds an approximation to the largest eigenvalue of the matrix after running a few iterations of the so-called “power method” from the numerical linear algebra literature. Then, using this information, it appr...
متن کاملApproximating Sets of Symmetric and Positive-Definite Matrices by Geodesics
We formulate a generalized version of the classical linear regression problem on Riemannian manifolds and derive the counterpart to the normal equations for the manifold of symmetric and positive definite matrices, equipped with the only metric that is invariant under the natural action of the general linear group.
متن کاملGeometrical Inverse Preconditioning for Symmetric Positive Definite Matrices
We focus on inverse preconditioners based on minimizing F(X) = 1− cos(XA, I), where XA is the preconditioned matrix and A is symmetric and positive definite. We present and analyze gradient-type methods to minimize F(X) on a suitable compact set. For this, we use the geometrical properties of the non-polyhedral cone of symmetric and positive definite matrices, and also the special properties of...
متن کاملA fast algorithm for computing the smallest eigenvalue of a symmetric positive-definite Toeplitz matrix
Recent progress in signal processing and estimation has generated considerable interest in the problem of computing the smallest eigenvalue of a symmetric positive definite Toeplitz matrix. Several algorithms have been proposed in the literature. Many of them compute the smallest eigenvalue in an iterative fashion, relying on the Levinson–Durbin solution of sequences of Yule–Walker systems. Exp...
متن کاملA hybrid method for computing the smallest eigenvalue of a symmetric and positive definite Toeplitz matrix
In this paper we suggest a hybrid method for computing the smallest eigenvalue of a symmetric and positive definite Toeplitz matrix which takes advantage of two types of methods, Newton’s method for the characteristic polynomial and projection methods based on rational interpolation of the secular equation.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 1998
ISSN: 0024-3795
DOI: 10.1016/s0024-3795(98)10038-1